Finite state<i>N</i>-agent and mean field control problems
نویسندگان
چکیده
We examine mean field control problems on a finite state space, in continuous time and over horizon. characterize the value function of problem as unique viscosity solution Hamilton-Jacobi-Bellman equation simplex. In absence any convexity assumption, we exploit this characterization to prove convergence, N grows, functions centralized -agent optimal limit function, with convergence rate order [see formula PDF]. Then, assuming convexity, show that is smooth establish propagation chaos, i.e. trajectories limiting trajectory, an explicit rate.
منابع مشابه
Lqg Optimal Control Arising in Mean Field Decision Problems
Abstract. We consider a linear-quadratic-Gaussian (LQG) optimal control problem where the generalized state space is the product of an Euclidian space and an infinite dimensional function space. This model originates from a mean field LQG game with a major player and a large number of minor players, and has importance in designing decentralized strategies in the game. We show that the underlyin...
متن کاملMean Field Control Hierarchy
In this paper we model the role of a government of a large population as a mean field optimal control problem. Such control problems are constrained by a PDE of continuity-type, governing the dynamics of the probability distribution of the agent population. We show the existence of mean field optimal controls both in the stochastic and deterministic setting. We derive rigorously the first order...
متن کاملMean-Field Optimal Control
We introduce the concept of mean-field optimal control which is the rigorous limit process connecting finite dimensional optimal control problems with ODE constraints modeling multi-agent interactions to an infinite dimensional optimal control problem with a constraint given by a PDE of Vlasov-type, governing the dynamics of the probability distribution of interacting agents. While in the class...
متن کاملComparing Mean Field and Euclidean Matching Problems
Combinatorial optimization is a fertile testing ground for statistical physics methods developed in the context of disordered systems, allowing one to confront theoretical mean field predictions with actual properties of finite dimensional systems. Our focus here is on minimum matching problems, because they are computationally tractable while both frustrated and disordered. We first study a me...
متن کاملMean Field Multi-Agent Reinforcement Learning
Existing multi-agent reinforcement learning methods are limited typically to a small number of agents. When the agent number increases largely, the learning becomes intractable due to the curse of the dimensionality and the exponential growth of user interactions. In this paper, we present Mean Field Reinforcement Learning where the interactions within the population of agents are approximated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2021
ISSN: ['1262-3377', '1292-8119']
DOI: https://doi.org/10.1051/cocv/2021032